Constructions of asymptotically shortest k-radius sequences
نویسندگان
چکیده
منابع مشابه
Constructing k-radius sequences
An n-ary k-radius sequence is a finite sequence of elements taken from an alphabet of size n such that any two distinct elements of the alphabet occur within distance k of each other somewhere in the sequence. These sequences were introduced by Jaromczyk and Lonc to model a caching strategy for computing certain functions on large data sets such as medical images. Let fk(n) be the shortest leng...
متن کاملThe existence of k-radius sequences
Let n and k be positive integers, and let F be an alphabet of size n. A sequence over F of length m is a k-radius sequence if any two distinct elements of F occur within distance k of each other somewhere in the sequence. These sequences were introduced by Jaromczyk and Lonc in 2004, in order to produce an efficient caching strategy when computing certain functions on large data sets such as me...
متن کاملSequences of Radius k for Complete Bipartite Graphs
A k-radius sequence for a graph G is a sequence of vertices of G (typically with repetitions) such that for every edge uv of G vertices u and v appear at least once within distance k in the sequence. The length of a shortest k-radius sequence for G is denoted by fk(G). We give an asymptotically tight estimation on fk(G) for complete bipartite graphs which matches a lower bound, valid for all bi...
متن کاملNear-shortest and K-shortest simple paths
We describe a new algorithm for solving the problem of enumerating all nearshortest simple (loopless) s-t paths in a graph G = (V,E) with non-negative edge lengths. Letting n = |V | and m = |E|, the time per path enumerated is O(nS(n,m)) given a user-selected shortest-path subroutine with complexity O(S(n,m)). When coupled with binary search, this algorithm solves the corresponding K-shortest s...
متن کاملK shortest path algorithms
This paper is focussed on algorithms to solve the k-shortest path problem. Three codes were described and compared on rand and grid networks using random generators available on http://www.dis.uniroma1.it/∼challenge9 Codes were also tested on the USA road networks available on the same URL address. One million paths were ranked in less than 3 seconds on random instances with 10 000 nodes and 10...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2012
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2011.11.009